Maximizing Aggregate Throughput in Information Networks Under Byzantine Attacks
نویسنده
چکیده
We present polynomial time algorithms that maximize the aggregate throughput in single-source multicast networks that employ random network coding and are subject to Byzantine attacks. Our results are applicable to wireline and wireless networks, assume no restrictions on size of min-cut from the source to the receivers and are provably optimal.
منابع مشابه
Attack-Aware Cooperative Spectrum Sensing in Cognitive Radio Networks under Byzantine Attack
Cooperative Spectrum Sensing (CSS) is an effective approach to overcome the impact of multi-path fading and shadowing issues. The reliability of CSS can be severely degraded under Byzantine attack, which may be caused by either malfunctioning sensing terminals or malicious nodes. Almost, the previous studies have not analyzed and considered the attack in their models. The present study introduc...
متن کاملA Survey of Solutions to Protect Against All Types of Attacks in Mobile Ad Hoc Networks
In recent years mobile networks have expanded dramatically, compared with other wireless networks. Routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. In this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...
متن کاملA New Intrusion Detection System to deal with Black Hole Attacks in Mobile Ad Hoc Networks
By extending wireless networks and because of their different nature, some attacks appear in these networks which did not exist in wired networks. Security is a serious challenge for actual implementation in wireless networks. Due to lack of the fixed infrastructure and also because of security holes in routing protocols in mobile ad hoc networks, these networks are not protected against attack...
متن کاملA Differentiated Pricing Framework for Improving the Performance of the Elastic Traffics in Data Networks
Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions...
متن کاملCapacity of Byzantine Agreement: Tight Bound for the Four Node Network
In this report, we consider the problem of maximizing the throughput of Byzantine agreement. Byzantine agreement is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport [1, 2]. There has also been more recent work on designing multicast algorithms that can survive Byzantine attacks (e.g., [3]). Many variations on the By...
متن کامل